Majorizing Sequences and Error Bounds for Iterative Methods
نویسندگان
چکیده
منابع مشابه
Majorizing Sequences and Error Bounds for Iterative Methods
Given a sequence {xn}n=Q in a Banach space, it is well known that if there a sequence {r^J^—QSUch that Wxn+X — xn\\ < tn + x — tn and lim tn = t* < °°, then {xn}n=Q converges to some x* and the error bounds IIjc* — jc II < f* — tn hold. It is shown that certain stronger hypotheses imply sharper error bounds, ■**-*„« <—-—Jxn-Xn-X*11* * \'*1-'0|M" > »• Representative applications to infinite seri...
متن کاملGeneralization Error Bounds for Noisy, Iterative Algorithms
In statistical learning theory, generalization error is used to quantify the degree to which a supervised machine learning algorithm may overfit to training data. Recent work [Xu and Raginsky (2017)] has established a bound on the generalization error of empirical risk minimization based on the mutual information I(S;W ) between the algorithm input S and the algorithm output W , when the loss f...
متن کاملError Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcing
Crowdsourcing has become an effective and popular tool for human-powered computation to label large datasets. Since the workers can be unreliable, it is common in crowdsourcing to assign multiple workers to one task, and to aggregate the labels in order to obtain results of high quality. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectat...
متن کاملComponentwise Error Analysis for Stationary Iterative Methods∗
How small can a stationary iterative method for solving a linear system Ax = b make the error and the residual in the presence of rounding errors? We give a componentwise error analysis that provides an answer to this question and we examine the implications for numerical stability. The Jacobi, Gauss-Seidel and successive overrelaxation methods are all found to be forward stable in a componentw...
متن کاملA Posteriori Error Bounds for Meshless Methods
We show how to provide safe a–posteriori error bounds for numerical solutions of well-posed operator equations using kernel–based meshless trial spaces. The presentation is kept as simple as possible in order to address a larger community working on applications in Science and Engineering. 1 Operator Equations Most contributions within application–oriented conferences only present numerical res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1980
ISSN: 0025-5718
DOI: 10.2307/2006227